package leetcode.bit_operation;

public class Lc2275 {

    public int largestCombination(int[] candidates) {
        int ans = 0;
        for (int b = 0; b < 25; b++) {
            int cnt = 0;
            for (int i = 0; i < candidates.length; i++) {
                cnt += candidates[i] >> b & 1;
            }
            ans = Math.max(ans, cnt);
        }
        return ans;
    }

    public static void main(String[] args) {
        System.out.println(Integer.toBinaryString(10000000));
    }


}
